Überlebenszeitanalyse: Der Log-Rang-Test

Rang maximal pour TPn

Let k an algebraically closed field, P the n-dimensional projective space over k and TPn the tangent vector bundle of P . In this paper I prove the following result : for every integer l, for every non-negative integer s, if Zs is the union of s points in sufficiently general position in P, then the restriction map H(P, TPn(l)) → H 0(Zs, TPn(l)|Zs) has maximal rank. This result implies that the...

Log-rank Test for Two Groups

And Then the Phone Rang

There are two critical interfaces that must be crossed when deploying any technological product. These are the hand-off from research to development and the hand-off from development to commercialization. These interfaces are frequently problematic, and are especially problematic when the technology being deployed is based on artificial intelligence. This paper will present our analysis of the ...

Modified signed log-likelihood test for the coefficient of variation of an inverse Gaussian population

In this paper, we consider the problem of two sided hypothesis testing for the parameter of coefficient of variation of an inverse Gaussian population. An approach used here is the modified signed log-likelihood ratio (MSLR) method which is the modification of traditional signed log-likelihood ratio test. Previous works show that this proposed method has third-order accuracy whereas the traditi...

Log-Powered Test Scenario Generation for Distributed Systems